Polynomial Solvability of Cost - BasedAbduction 1
نویسندگان
چکیده
Recent empirical 9, 2] studies have shown that many interesting cost-based abduction problems can be solved eeciently by considering the linear program relaxation of their integer program formulation. We tie this to the concept of total unimodularity from network ow analysis, a fundamental result in polynomial solvability. From this, we can determine the polynomial solvability of abduction problems and, in addition, present a new heuristic for branch and bound in the non-polynomial cases. 1 Special thanks to the anonymous reviewers who helped signiicantly improve this paper.
منابع مشابه
Polynomial Solvability of Cost-Based Abduction
In recent empirical studies we have shown that many interesting cost-based abduction problems can be solved efficiently by considering the linear program relaxation of their integer program formulation. We tie this to the concept of total unimodularity from network flow analysis, a fundamental result in polynomial solvability. From this, we can determine the polynomial solvability of abduction ...
متن کاملA Linear Constraint Satisfaction Approach to Cost - BasedAbduction 1
Abduction is the problem of nding the best explanation for a given set of observations. Within AI, this has been modeled as proving the observation by assuming some set of hypotheses. Cost-based abduction associates a cost with each hypothesis. The best proof is the one which assumes the least costly set. Previous approaches to nding the least cost set have formalized cost-based abduction as a ...
متن کاملMatrix Equations and Hilbert's Tenth Problem
We show a reduction of Hilbert’s tenth problem to the solvability of the matrix equation A1 1 A i2 2 · · ·A ik k = Z over non-commuting integral matrices, where Z is the zero matrix, thus proving that the solvability of the equation is undecidable. This is in contrast to the case whereby the matrix semigroup is commutative in which the solvability of the same equation was shown to be decidable ...
متن کاملOn strongly polynomial algorithms for some classes of quadratic programming problems∗†
In this paper we survey some results concerning polynomial and/or strongly polynomial solvability of some classes of quadratic programming problems. The discussion on polynomial solvability of continuous convex quadratic programming is followed by a couple of models for quadratic integer programming which, due to their special structure, allow polynomial (or even strongly polynomial) solvabilit...
متن کاملThe Complexity of the Equivalence and Equation Solvability Problems over Meta-abelian Groups
We provide polynomial time algorithms for deciding equation solvability and identity checking over groups that are semidirect products of two nite Abelian groups. Our main method is to reduce these problems to the sigma equation solvability and sigma equivalence problems over modules for commutative unital rings.
متن کامل